Iterated Local Search for dynamic assembly line rebalancing problem
نویسندگان
چکیده
منابع مشابه
An Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem
In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملController Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملIterated local search for the quadratic assignment problem
Iterated local search (ILS) is a surprisingly simple but at the same time powerful metaheuristic for nding high quality approximate solutions for combinatorial optimization problems. ILS is based on the repeated application of a local search algorithm to initial solution which are obtained by mutations of previously found local optima | in most ILS algorithms these mutations are applied to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2016
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2016.07.679